cloud data manag yahoo feed frenzi select materi user event feed benchmark cloud serv system ycsb mapreduc system hadoop larg scale data analysi wide recogn studi recent explos number system develop cloud data serv newer system address cloud oltp applic typic support acid transact exampl system propos cloud serv includ bigtabl pnut cassandra hbase azur couchdb simpledb voldemort appli divers rang applic differ consider tradit tpc serv workload number emerg cloud serv system wide rang propos applic coupl lack applesto appl perform comparison make difficult understand tradeoff system workload suit present yahoo cloud serv benchmark ycsb framework goal facilit perform comparison gener cloud data serv system defin core set benchmark report result wide system cassandra hbase yahoo pnut simpl shard mysql implement hope foster develop addit cloud benchmark suit repres class applic make benchmark tool open sourc regard kei featur ycsb framework tool extens support easi definit workload addit make easi benchmark system cloud databas data manag cloud programm provid forum exchang promot idea experi knowledg foster collabor nation research educ network academ research institut topic data storag data manag cloud storag task forc tf storag aim task forc provid forum exchang promot idea experi knowledg relat data storag data manag cloud storag identifi promot common standard techniqu technolog procedur field data storag relev educ research commun focal point gather storag expertis european educ research environ identifi coordin collabor develop storag servic liais tf emc topic nren aai feder nonweb storag servic liais snia commun grid environ hpc cloud environ internet apan storag cloud activ task forc focu activ terena constitu recogn activ constitu relat grid storag cloud compon work activ prevent unnecessari duplic effort task forc open individu offer expertis manpow equip servic particip voluntari basi chair task forc jan meijer uninett respons prepar agenda meet coordin work task forc respons ensur agre deliver produc group form deem secretari task forc appoint terena respons take minut meet make logist arrang web concept paper focu translat model problem turn problem address issu concern reader estim pr pr fle estim pr elf directli interest probabl wouldn reduc problem direct approach estim pr fle adequ turn process estim pr elf understand imagin divid french english string form ill form precis notion mind string il va la bibliothqu live hous colorless green idea sleep furious form string lava bibliothqu live hous translat french string english spring form french string sea form english string hope land good import model pr elf concentr probabl wellform english string import model pr fle concentr probabl form french string reduc probabl form french string factor spread probabl liber ill form french string effect translat argument maxim function maxim cf posit constant translat model prodig sprai probabl place ill form french string fact discuss section asynchron view mainten vlsd databas queri model recent gener larg scale distribut vlsd share data storag system includ pnut bigtabl dynamo cassandra intention simpl focus simpl lookup scan trade queri express massiv scale index view expand queri express system materi complex access path queri result paper examin mechan implement index view massiv scale distribut databas web applic minim updat latenc critic advoc defer work maintain view index examin design space conclud type view implement call remot view tabl rvt local view tabl lvt provid good tradeoff system throughput minim view stale describ construct maintain view tabl implement index group aggreg view equijoin view select view introduc analyz consist model make easier applic develop cope impact defer view mainten empir evalu quantifi mainten cost view show significantli improv cost evalu complex queri optim complex extract program evolv text data inform extract approach consid static text corpora appli real world text corpora dynam evolv time extract inform date appli repeatedli consecut corpu snapshot appli scratch snapshot lot time avoid recent develop cyclex system recycl previou result speed subsequ corpu snapshot cyclex demonstr promis recycl idea work limit consid program singl blackbox practic program complex multipl blackbox connect composit workflow paper present delex system remov limit identifi difficult challeng rais delex includ model complex program recycl purpos implement recycl process effici search optim execut plan vast plan space recycl altern describ solut challeng final describ extens experi rule base learn base program real world data set demonstr util approach optim complex extract program evolv text data inform extract approach consid static text corpora appli real world text corpora dynam evolv time extract inform date appli repeatedli consecut corpu snapshot appli scratch snapshot lot time avoid recent develop cyclex system recycl previou result speed subsequ corpu snapshot cyclex demonstr promis recycl idea work limit consid program singl blackbox practic program complex multipl blackbox connect composit workflow paper present delex system remov limit identifi difficult challeng rais delex includ model complex program recycl purpos implement recycl process effici search optim execut plan vast plan space recycl altern describ solut challeng final describ extens experi rule base learn base program real world data set demonstr util approach declar network claremont report databas research abstract queri process import mechan data manag exist matur techniqu effect queri optim effici queri execut vast major techniqu assum workload small transact task strong requir acid properti emerg comput paradigm grid cloud comput increasingli larg volum data commonli process support data driven research intens data analysi scenario process data stream fly queri web servic fact metadata fed optim miss compil time grow interest optim criteria monetari cost energi consumpt creat uniqu set requir queri process system requir met modern techniqu entireti interest solut effici tool develop isol gener queri processor expect combin featur address issu lie confluenc research initi paper aim present vision processor explain function requir discuss open issu challeng build cloud yahoo bellweth analysi search cost deffect queri ddefin predictor larg databas web data manag enorm growth number document circul web increas improv web data manag system order evalu perform system simul approach paper studi main simul model deploi web data manag specif survei recent simul approach web data represent storag term cach web data trace evalu cloud comput yahoo parallel evalu composit aggreg queri abstract aggreg measur summar subset data valuabl exploratori analysi decis support depend aggreg easili comput class queri call composit subset measur previous introduc correl aggreg queri easili express paper consid evalu composit subset measur queri larg distribut system describ cross node data redistribut strategi take account nest structur queri main idea group data block cube space aggreg gener local block leverag previous propos optim block partit scheme overlap block slide window aggreg handl guarante final answer union local result duplic expens data combin step identifi import partit paramet propos optim algorithm demonstr effect optim minim queri respons time cloud comput thoma watson effici inform extract evolv text data current inform extract approach consid static text corpora typic appli real world text corpora dynam evolv time extract inform date appli repeatedli consecut corpu snapshot describ cyclex approach effici execut repeat recycl previou effort specif current corpu snapshot cyclex identifi text portion appear previou corpu snapshot cyclex execut recycl result part combin result result execut remain part produc complet result realiz cyclex rais challeng includ model inform extractor explor trade runtim complet identifi overlap text make inform cost base decis redo scratch recycl previou result describ initi solut challeng experi real world data set demonstr util approach onlin model content optim address email describ content publish system select articl serv user choos editori program pool frequent refresh deploi major internet portal select articl serv hundr million user visit dai significantli increas number user click origin manual approach editor period select articl displai challeng face includ dynam content pool short articl lifetim stationari click rate extrem high traffic volum fundament problem solv quickli identifi item popular user segment exploit remain current explor underli pool constantli identifi promis altern quickli discard poor perform approach base track articl perform real time onlin model describ characterist constraint applic set discuss design choic show import effect coupl onlin model simpl random procedur discuss challeng encount product onlin content publish environ highlight issu deserv care attent analysi applic suggest number futur research avenu deffort inform extract current approach develop inform extract program larg focus produc precis result suffer major limit difficult execut partial program obtain meaning result produc long debug loop take long time obtain meaning result finish run precis program render approach impract time sensit applic final write precis program wast signific amount effort approxim result produc quickli satisfactori set address limit propos iflex approach relax precis requir enabl effort iflex develop declar languag quickli write initi approxim program world semant iflex evalu approxim queri processor quickli extract approxim result examin result refin obtain increasingli precis result refin enlist effort assist suggest refin base data current version extens experi real world domain demonstr util iflex approach effici bulk insert distribut order tabl studi problem bulk insert record tabl system horizont rang partit data larg cluster share machin tabl partit contigu portion tabl kei rang accept record insert rang exampl system includ bigtabl googl pnut yahoo bulk insert exist tabl insert record end small number data partit obtain throughput poor due ineffect cluster parallel propos approach plan phase invok actual insert creat partit intellig distribut partit machin plan phase ensur insert load balanc tradeoff cost move partit result throughput gain plan phase minim sum partit movement time insert time show problem variat np hard bin pack reduc problem pack vector give solut provabl approxim guarante evalu approach prototyp system deploi cluster machin show yield signific improv na ve techniqu workload dawar anonym techniqu larg dscale dataset effici top dk process queri ddepend function studi effici evalu top queri data item score item dynam comput appli item specif function paramet queri onlin retail store rank item price function quantiti queri stai night discount doubl bed room similarli rank rout onlin map predict congest level score congest function time queri pm fridai palo alto congest level north high paramet number night time onlin map queri exampl queri time onlin applic stringent respons time requir infeas evalu item specif function determin item score number item larg space consider make infeas pre comput store score item input paramet paper develop techniqu compress larg set item score paramet valu divid paramet rang interv take account expect queri workload compress represent top prune queri result experi show propos techniqu scalabl effici pnut yahoo host data serv platform describ pnut massiv parallel geograph distribut databas system yahoo web applic pnut data storag organ hash order tabl low latenc larg number concurr request includ updat queri record consist guarante host central manag geograph distribut servic util autom load balanc failov reduc oper complex version system serv product describ motiv pnut design implement tabl storag replic layer present experiment result claremont report databas research abstract queri process import mechan data manag exist matur techniqu effect queri optim effici queri execut vast major techniqu assum workload small transact task strong requir acid properti emerg comput paradigm grid cloud comput increasingli larg volum data commonli process support data driven research intens data analysi scenario process data stream fly queri web servic fact metadata fed optim miss compil time grow interest optim criteria monetari cost energi consumpt creat uniqu set requir queri process system requir met modern techniqu entireti interest solut effici tool develop isol gener queri processor expect combin featur address issu lie confluenc research initi paper aim present vision processor explain function requir discuss open issu challeng inform extract challeng manag unstructur data past year build end end system wisconsin manag unstructur data extract integr user interact paper describ kei inform extract challeng run sketch solut discuss develop declar languag optim languag gener proven incorpor user feedback process develop wikibas user interfac feedback effort push rdbmss work suggest manag unstructur data open interest research challeng challeng greatli benefit wealth work manag structur data carri databas commun purpl sox extract manag system describ purpl sox psox em prototyp extract manag system built yahoo goal psox em manag larg number sophist extract pipelin applic domain web scale minimum human involv kei proposit extens abil swap extract oper explain abil track proven extract result social feedback support facil gather reconcil multipl potenti conflict sourc commun system world onlin dblife commun inform manag platform databas research commun demo commun system world onlin sourc dawar entiti match composit approach entiti match record linkag plai crucial role integr multipl data sourc numer match solut develop solut larg exploit inform mention emploi singl match techniqu show exploit inform data sourc significantli improv match accuraci observ sourc vari substanti level semant ambigu requir match techniqu addit benefici group match mention relat sourc sourc observ lead larg space match strategi analog space queri evalu plan consid relat optim propos view entiti match composit basic step match execut plan analyz formal properti plan space show find good match plan emploi idea social network analysi infer ambigu related data sourc conduct extens experi real world data set web domain person inform manag pim result show solut significantli outperform current match method optim mpf queri decis support probabilist infer manag uncertain data probabilist framework attract interest databas literatur central comput challeng probabilist infer paper present broad class aggreg queri call mpf queri inspir literatur probabilist infer statist machin learn mpf margin product function queri aggreg queri styliz join relat probabilist infer join correspond take product probabl distribut aggreg oper correspond margin probabilist infer express directli mpf queri relat set optim evalu mpf queri provid scalabl support probabilist infer databas system optim mpf queri build idea databas queri optim tradit algorithm variabl elimin belief propag probabilist infer literatur main motiv introduc mpf queri support easi express effici evalu probabilist infer dbm observ class queri rang decis support task present optim mpf queri gener form arbitrari function probabl distribut handl demonstr decis support applic number illustr natur exampl databas web databas web declar inform extract datalog embed extract predic paper argu develop inform extract program datalog embed procedur extract predic good proce compar current ad hoc composit perl datalog cleaner power compos small extract modul larger program write program retain enhanc import advantag current approach program easi understand debug modifi write program framework appli queri optim techniqu program run varieti data set effici monolith program optim base statist data invok show optim program rais challeng specif text data accommod current relat optim framework provid initi solut extens experi real world data demonstr optim vital program effect optim program written propos framework declar inform extract datalog embed extract predic paper argu develop inform extract program datalog embed procedur extract predic good proce compar current ad hoc composit perl datalog cleaner power compos small extract modul larger program write program retain enhanc import advantag current approach program easi understand debug modifi write program framework appli queri optim techniqu program run varieti data set effici monolith program optim base statist data invok show optim program rais challeng specif text data accommod current relat optim framework provid initi solut extens experi real world data demonstr optim vital program effect optim program written propos framework olap imprecis data domain constraint recent work focus olap imprecis data fact region point multidimension space provid multipl world semant data develop effici solut answer olap aggreg queri imprecis fact solut assum imprecis fact interpret independ kei assumpt violat practic imprecis fact real world applic correl correl captur domain integr constraint repair custom name model place citi text span refer person citi paper provid solut answer olap aggreg queri imprecis data presenc domain constraint describ simpl power constraint languag defin mean account constraint queri answer prove olap queri answer effici databas fact margin exploit regular constraint space captur constraint hypergraph fact space effici construct extens experi real world synthet data demonstr effect approach build structur web commun portal top ddown structur commun portal extract integr inform raw web page present unifi view entiti relationship commun paper argu build portal top composit increment approach good proce compar current approach emploi complex monolith techniqu approach easier develop understand debug optim approach select small set import commun sourc compos plan extract integr data sourc set extract integr oper execut plan yield initi structur portal increment expand portal monitor evolut current data sourc detect add data sourc describ initi solut step case studi emploi solut build dblife portal databas commun found dblife built quickli achiev high accuraci simpl extract integr oper maintain expand human effort initi solut case studi demonstr feasibl potenti approach privaci skylin privaci multidimension adversari knowledg privaci import issu data publish organ distribut aggreg person data research step ensur adversari predict sensit inform pertain individu high confid problem complic fact addit publish data adversari access resourc public record social network relat individu call extern knowledg robust privaci criterion extern knowledg consider paper describ gener framework reason privaci presenc extern knowledg framework propos multidimension approach quantifi adversari extern knowledg approach publish organ investig privaci threat enforc privaci requir presenc type amount extern knowledg main technic contribut includ multidimension privaci criterion intuit flexibl previou approach model background knowledg addit provid algorithm measur disclosur sanit data improv comput effici order magnitud techniqu exploratori mine cube space peopleweb paper introduc metalog queri logic system design reason web metalog start fill call peopl axi web tailor peopl machin allow formul declar logic rule metalog distinct featur lower entri access level emploi pseudo natur languag pnl interfac easi understand metalog expert field capabl advanc solut enhanc custom user friendli kei compon wide adopt intellig semant web technolog user dcentric research challeng commun inform manag system cimpl joint project wisconsin yahoo research build system manag inform onlin commun paper discuss fundament role user plai system difficult user centric research challeng rais role respect contribut system access leverag social interact user olap uncertain imprecis data extend olap data model repres data ambigu specif imprecis uncertainti introduc alloc base approach semant aggreg queri data identifi natur queri properti shed light altern queri semant work repres queri ambigu data knowledg paper handl imprecis uncertainti olap set learn aggreg view paper introduc class data mine problem call learn aggreg view contrast tradit problem learn singl tabl train exampl goal learn multipl aggreg view underli data access aggreg data motiv problem present gener problem framework develop learn method rfa restrict free aggreg view defin count sum avg stdev offer theoret experiment result character propos method queri languag network attack data grow sophist divers malici activ internet present challeng network secur analyst paper describ effort develop databas queri languag network attack data firewal intrus detect system honeynet step object develop prototyp databas queri interfac identifi coordin scan activ network attack data creat set aggreg view templat sql queri time persist target servic spatial dispers tempor dispers enabl evalu coordin scan dimens demonstr util interfac conduct case studi set firewal intrus detect system log dshield org show interfac identifi gener characterist coordin activ instanc unusu activ difficult mine data result highlight potenti develop gener queri languag broad class network intrus data case studi expos challeng face extend system gener queri potenti vast quantiti data exploratori mine cube space workload dawar anonym data publish gener concern protect individu privaci recent studi case adversari possess kind knowledg data articl show knowledg mechan algorithm anonym data public lead extra inform assist adversari jeopard individu privaci mechan minim inform loss attempt loophol attack call attack minim attack articl introduc model call confidenti deal minim attack propos feasibl solut experi show minim attack practic concern real dataset algorithm prevent attack overhead inform loss relax dcurrenc serializ middl dtier cach replic manag inform extract state art research direct declar network languag execut optim network distribut system commun recent explor varieti network architectur applicationlevel overlai network prototyp gener internet architectur context investig declar network distribut recurs queri engin power vehicl acceler innov network architectur declar network repres signific applic area databas research recurs queri process paper address fundament databas issu domain motiv formal defin network datalog ndlog languag declar network specif introduc prove correct relax version tradit semi na ve queri evalu techniqu overcom fundament problem tradit techniqu asynchron distribut set dynam network state formal eventu consist program burst updat arriv midst queri execut fourth present number queri optim opportun aris declar network context includ applic tradit techniqu optim present evalu result idea implement declar network system run machin emulab network testb effici alloc algorithm olap imprecis data recent work propos extend olap data model support data ambigu specif imprecis uncertainti process call alloc propos transform imprecis fact tabl form call extend databas readili answer olap aggreg queri work present scalabl effici algorithm creat extend databas perform alloc imprecis fact tabl alloc polici requir multipl iter imprecis fact tabl straightforward evalu approach introduc earlier highli ineffici optim iter alloc polici larg dataset present challeng consid previous knowledg addit develop scalabl alloc algorithm present perform evalu demonstr effici compar perform respect straightfoward approach composit subset measur measur numer summari collect data record produc appli aggreg function summar collect subset larg dataset comput measur subset typic user collect fundament problem multidimension data model treat record point space defin dimens attribut offer natur space data subset consid summar candid tradit sql olap construct group cube comput measur subset drawn space group summar limit collect subset cube summar subset space restrict measur summar data subset step aggreg function sum field valu data record paper introduc composit subset measur comput aggreg data record measur relat subset summar natur relat region multidimension space offer flexibl group cube choic data subset summar framework meaning summari comput target collect data subset propos algebra call aw ra equival pictori languag call aggreg workflow aggreg workflow intuit express composit measur queri underli algebra design facilit effici multi scan execut describ evalu framework base multipl pass sort scan origin dataset pass measur evalu simultan depend measur contain relationship underli subset data orchestr reduc memori footprint comput present perform evalu demonstr benefit approach bellweth analysi predict global aggreg local region theori nearest neighbor index commun inform manag introduc cimpl joint project univers illinoi univers wisconsin cimpl aim develop softwar platform rapidli deploi custom manag data rich onlin commun describ envis work softwar platform prototyp dblife commun portal develop databas research commun describ technic challeng cimpl solut approach final discuss manag uncertainti proven crucial task make softwar platform practic content metadata behavior inform direct yahoo research integr db ir technolog sound hand clap databas db inform retriev ir evolv separ field modern applic custom support health care digit librari requir capabl data text manag set tradit db queri sql xqueri flexibl handl applicationspecif score rank ir system hand lack effici support handl structur part data metadata give applic develop adequ control rank function paper analyz requir advanc text data rich applic integr platform core function manag api easi program import issu highlight reconcil flexibl score rank model optimiz order accommod wide varieti target applic effici discuss system design scratch increment built top exist architectur result analys cast seri challeng db ir commun similar search high ddimension dataset local sensit hash lsh method perform probabilist dimens reduct high dimension data basic idea hash input item similar item map bucket high probabl number bucket smaller univers input item hash scheme wide purpos imag audio similar identif duplic detect signific drawback basic lsh scheme requir larg number hash tabl attain good search qualiti lv al propos multi probe lsh scheme built basic lsh index scheme intend counter drawback basic lsh scheme basic concept multi probe approach search multipl bucket parallel queri result reduct space complex attribut intellig probe sequenc multi probe lsh scheme intend multi probe approach step implement distribut version multi probe approach distribut implement improv time complex space complex ad comput power dispos intend approach guarante scalabl respect real world scenario compromis effici multi probe approach nearest neighbor index skylin queri data set multi dimension space decis make applic tradition point domin point dimens wors dimens skylin data set consist point domin point cater applic requir control size skylin handl data set structur work propos extend definit skylin base variant domin relationship difficult implement variant separ system set effort made provid gener framework specif implement easili materi framework nearest neighbor index skylin queri data set multi dimension space decis make applic tradition point domin point dimens wors dimens skylin data set consist point domin point cater applic requir control size skylin handl data set structur work propos extend definit skylin base variant domin relationship difficult implement variant separ system set effort made provid gener framework specif implement easili materi framework view learn statist relat learn applic mammographi statist relat learn srl construct probabilist model relat databas kei capabl srl learn arc bay net sens connect entri row relat tabl tabl srl approach constrain exist databas schema databas applic user find profit defin altern view databas effect defin field tabl field tabl highli learn provid srl capabl learn view view learn statist relat learn applic mammographi statist relat learn srl construct probabilist model relat databas kei capabl srl learn arc bay net sens connect entri row relat tabl tabl srl approach constrain exist databas schema databas applic user find profit defin altern view databas effect defin field tabl field tabl highli learn provid srl capabl learn view framework set dorient comput induct logic program applic gener invers entail declar rout extens rout declar queri internet core rout infrastructur arguabl robust cient proven di cult evolv accommod applic prior research problem includ hard code rout protocol hand fulli extens activ network paper explor point design space aim strike balanc extens robust rout infrastructur basic idea solut call declar rout express rout protocol databas queri languag show queri languag natur fit rout express varieti rout protocol compact clean fashion discuss secur propos term comput express power languag design simul deploy planetlab demonstr system impos fundament limit rel tradit protocol amen queri optim sustain long live rout network churn congest incognito effici full ddomain danonym textur benchmark measur perform text queri relat dbm introduc benchmark call textur text relat measur rel strength weak combin text process relat workload rdbm trec benchmark focu qualiti focu cienci textur micro benchmark queri workload consid central text support issu previou benchmark queri relev rank comput answer richer mix text relat process reflect trend seamless integr develop benchmark address problem gener larg text collect reflect perform characterist seed collect essenti control studi specif data characterist ect perform addit present benchmark perform number commerci dbmss present valid synthet gener popul text field cach good currenc consist complet sql extens queri explicitli data qualiti requir term currenc consist propos earlier paper paper develop data qualiti awar finer grain cach model studi cach design term fundament properti presenc consist complet currenc model abstract view cach queri process layer open door adapt cach manag describ implement approach build mtcach framework partial materi view optim check consist constraint gener dynam plan includ currenc check inexpens check dynam consist constraint valid plan compil solut support transpar cach transact fine grain data currenc consist guarante olap uncertain imprecis data extend olap data model repres data ambigu specif imprecis uncertainti introduc alloc base approach semant aggreg queri data identifi natur queri properti shed light altern queri semant work repres queri ambigu data knowledg paper handl imprecis uncertainti olap set predict cube recent epitom introduc patch base probabl model learn compil larg number exampl patch input imag paper describ epitom model video data describ signific comput speedup incorpor epitom infer learn algorithm case video epitom estim model small space time cube input data epitom model reconstruct task show result video super resolut video interpol object remov comput effici interest advantag epitom represent reliabl estim video larg amount miss data illustr abil task reconstruct drop frame video broadcast degrad video denois sever corrupt video synops queri optim space dcomplex perspect databas system precomput synops data estim cost altern plan queri optim number altern synopsi structur propos histogram commonli histogram prove effect cost estim singl tabl select queri join long challeng model histogram maintain individu tabl celebr result ioannidi christodoulaki observ error propag exponenti number join queri articl make main contribut studi space complex synops queri optim inform theoret perspect offer evid support histogram singl tabl select includ analysi data distribut common practic illustr limit join queri broad class common queri involv join specif queri involv kei foreign kei join show strategi store small precomput sampl databas yield probabilist guarante space optim import properti sampl databas statist optim edam project mine atmospher aerosol dataset data mine gener paper identifi major area research topic gener data mine research effort decad privaci preserv data mine result develop numer algorithm exist research appli applic context unclear current algorithm directli applic problem context paper identifi signific applic context requir protect privaci sophist data analysi area question suppli chain manag arguabl import research area product oper manag enorm practic relev examin area suppli chain manag identifi research challeng opportun privaci preserv data mine gener frontier privaci preserv data mine area privaci preserv data mine ppdm start semin paper prompt numer research effort fundament question remain unansw area matur point establish relev larger societ includ busi industri exist method extend modifi directli applic real world set paper describ area suppli chain manag scm encompass entir busi process industri deal product involv multipl interrel trade partner data mine part dai tool appli scm statist data analysi demand forecast essenti part edam project mine mass spectra integr structur index invert list recent great deal interest develop techniqu evalu path express collect xml document gener path express structur keyword compon method propos process path express graph tree structur xml data method classifi broad class involv graph travers input queri evalu travers data graph compress represent class involv inform retriev style process invert list framework structur index propos substitut graph travers structur index proven effect appli queri examin coars structur document mass spectrum label theori practic introduc problem label particl mass spectrum substanc develop formal represent problem take account practic complic unknown compound nois task bottl neck analyz data gener instrument real time environment monitor mass spectrum label theori practic introduc problem label particl mass spectrum substanc develop formal represent problem take account practic complic unknown compound nois task bottl neck analyz data gener instrument real time environment monitor mass collabor case studi present overview custom support system develop quiq applic systemat mass collabor build observ larg commun user effect leverag advanc interest commun recent year mass collabor propos inform integr program debug show promis paper outlin main idea technic challeng describ quiq architectur technic main achiev includ db ir engin scalabl notif engin rich class user alert power access control mechan support role dynam group field level access control techniqu edit navig hierarchi dynam site synops queri optim space dcomplex perspect databas system precomput synops data estim cost altern plan queri optim number altern synopsi structur propos histogram commonli histogram prove effect cost estim singl tabl select queri join long challeng model histogram maintain individu tabl celebr result ioannidi christodoulaki observ error propag exponenti number join queri articl make main contribut studi space complex synops queri optim inform theoret perspect offer evid support histogram singl tabl select includ analysi data distribut common practic illustr limit join queri broad class common queri involv join specif queri involv kei foreign kei join show strategi store small precomput sampl databas yield probabilist guarante space optim import properti sampl databas statist optim edam project exploratori data analysi manag wisconsin cost dbase label group mass spectra integr structur index invert list recent great deal interest develop techniqu evalu path express collect xml document gener path express structur keyword compon method propos process path express graph tree structur xml data method classifi broad class involv graph travers input queri evalu travers data graph compress represent class involv inform retriev style process invert list framework structur index propos substitut graph travers structur index proven effect appli queri examin coars structur document relax currenc consist good sql widespread grow asynchron copi improv scalabl perform avail practic lack firm semant foundat applic written understand queri data current copi good explicit requir guarante propos make knowledg dbm explicit currenc consist amp constraint queri develop techniqu dbm guarante constraint satisfi paper describ model express amp constraint defin semant propos sql syntax explain amp constraint enforc mtcach prototyp mid tier databas cach includ constraint replica updat polici elegantli integr cost base queri optim consist constraint enforc compil time currenc constraint enforc run time dynam plan check currenc local replica select plan approach make optim cach dbm time guarante applic data amp quot good amp quot purpos support relax currenc consist constraint mtcach typic commerc site ebai make frequent replic cach data brows auction categori data item price number bid date user understand accept editori call amp calendareditori editori call amp calendareditori quiq engin hybrid ir db system applic involv rapidli chang textual data requir tradit dbm capabl current system unsatisfactori paper describ hybrid ir db system serv basi quiqconnect product collabor custom support applic present queri paradigm system architectur perform result data mine fast algorithm fast result guest editori vital sign medic emerg team scale mine algorithm larg databas framework measur differ data characterist data mine algorithm build model captur interest aspect underli data develop framework quantifi differ call deviat dataset term model induc addit quantit intuit interpret measur differ deviat dataset comput fast framework cover wide varieti model includ frequent itemset decis tree classifi cluster captur standard measur deviat misclassif rate chi squar metric special case show statist techniqu appli deviat measur assess differ model contact author support microsoft graduat fellowship research support grant ibm corpor support armi research offic grant daag signific mine data stream block evolut scientif commerci applic reli process transient data stream addit process queri stream continu analysi receiv attent recent due specif characterist data stream common analysi techniqu area data mine directli applic stream core oper data analysi densiti estim captur unknown distribut analysi task modern densiti estim base kernel function wavelet wavelet base profit abil identifi discontinu local oscil paper present approach comput wavelet densiti estim data stream estim continu updat arriv data provid accur analyt result consum constant amount memori estim adapt memori cpu usag chang memori size comput overhead runtim experiment evalu prove feasibl approach show superior wavelet densiti estim compar kernel base counterpart mass collabor data mine demon mine monitor evolv data data mine algorithm focu research recent practic input data data mine process resid larg data warehous data date period occasion addit delet block data data mine algorithm assum input data static design arbitrari insert delet data record squeez relat databas system demon mine monitor evolv data data mine algorithm focu research recent practic input data data mine process resid larg data warehous data date period occasion addit delet block data data mine algorithm assum input data static design arbitrari insert delet data record squeez relat databas system dynam histogram captur evolv data set paper introduc dynam histogram construct maintain increment develop dynam histogram construct algorithm show close static histogram qualiti experiment studi cover wide rang dataset updat pattern includ histogram mainten share environ build insight offer dynam algorithm propos static histogram construct algorithm fast gener histogram close qualiti highli accur expens construct optim histogram introduct cost execut relat oper function size tupl stream input oper intermedi oper turn determin select previou oper complex queri import precis intermedi size estim error brows interact dbm support respon websit abstract icicl dtune sampl approxim queri answer approxim queri answer system provid fast altern olap system applic toler small error queri answer contrast plot dsphere tree space time nearest neighbour search rainforest framework fast decis tree construct larg dataset classif larg dataset import data mine problem classif algorithm propos literatur studi shown algorithm uniformli outperform algorithm term qualiti paper present unifi framework decis tree classifi separ scalabl aspect algorithm construct decis tree central featur determin qualiti tree gener algorithm easi instanti specif algorithm literatur includ cart guest editor introduct logic dbase heterogen inform system cluster larg dataset arbitrari metric space cluster partit collect object group call cluster similar object fall group similar object defin distanc function satisfi triangl inequ distanc function collect object describ distanc space distanc space oper data object comput distanc scalabl algorithm literatur assum special type distanc space dimension vector space vector oper object present scalabl algorithm design cluster larg dataset distanc space algorithm bubbl knowledg scalabl cluster algorithm data distanc space algorithm bubbl fm improv bubbl reduc number call distanc function computation expens algorithm make singl scan nearest neighbor meaning explor effect dimension nearest neighbor problem show broad set condit broader independ ident distribut dimens dimension increas distanc nearest data point approach distanc farthest data point provid practic perspect present empir result real synthet data set demonstr effect occur dimens result interpret high dimension index meaning illustr point identifi high dimension workload effect occur result emphas methodolog univers databas literatur evalu high dimension index techniqu flaw modifi techniqu propos literatur evalu versu simpl fast densiti estim cf dkernel larg databas cactu cluster categor data summari cluster import data mine problem earlier work cluster focuss numer attribut natur order attribut valu recent cluster data categor attribut attribut valu natur order receiv attent previou algorithm give formal descript cluster discov assum user post process output algorithm identifi final cluster paper introduc formal cluster categor attribut gener definit cluster numer attribut describ fast summarizationbas algorithm call cactu discov cluster data cactu import characterist algorithm requir scan dataset fast scalabl experi varieti dataset show cactu outperform previou work factor cactu find cluster subset attribut perform subspac cluster data featur import cluster span attribut scenario number attribut larg experiment evalu studi perform cactu real synthet dataset classif regress monei acan grow tree framework measur data characterist data mine algorithm build model captur interest aspect underli data develop framework quantifi differ call deviat dataset term model induc framework cover wide varieti model includ frequent itemset decis tree classifi cluster captur standard measur deviat misclassif rate chi squar metric special case show statist techniqu appli deviat measur assess differ model meaning underli dataset statist signific differ characterist discuss practic applic boat doptimist decis tree construct classif import data mine problem train databas record tag class label goal classif build concis model predict class label futur unlabel record popular class classifi decis tree current algorithm construct decis tree includ main memori algorithm make scan train databas level tree introduc algorithm boat decis tree construct improv earlier algorithm perform function boat construct level tree scan train databas result averag perform gain previou work kei perform improv optimist approach tree construct construct initi tree small subset data refin arriv final tree guarante differen bottom dup comput spars iceberg cube introduc iceberg cube problem reformul datacub cube problem iceberg cube problem comput group partit aggreg count minimum support threshold result iceberg cube answer group queri claus count greater threshold mine multidimension associ rule complement exist strategi identifi interest subset cube precomput present algorithm buc iceberg cube comput buc build cube bottom build cube start group singl attribut group pair attribut group attribut opposit techniqu propos earlier comput cube import practic advantag buc avoid comput larger group by meet minimum probabilist optim top queri review magic set strang wai implement logic program mine larg databas equival kei relat schema conjunct queri reminisc influenti paper databas manag system abstract high level queri data manipul languag sql request state procedur refer access path paper describ system choos access path simpl singl relat complex queri join user specif desir data boolean express predic system experiment databas manag system develop carri research relat model data system design built member ibm san jose research laboratori protect qualiti servic exist inform system organ offer extern access data mechan ensur desir level servic local user propos mechan call provid agent pa architectur protect local user ensur dba qualiti servic local request face comput demand made extern request pa gener purpos solut enhanc inform system novelti approach combin request profil load control mechan improv protect perform requir modif underli inform system demonstr effect propos techniqu prototyp pa commerci dbm introduct peopl access inform organiz boundari inform system increasingli access integr technolog system own compress relat index propos compress algorithm tailor databas applic appli collect record effect record low medium cardin field addit techniqu support fast decompress gzip typic take time cpu time decompress relat achiev compress ratio algorithm achiev compress numer field low medium cardin field type handl map valu small rang integ algorithm complement compress techniqu gener numer text imag field promis applic domain includ decis support system dss fact tabl largest tabl applic low medium cardin field typic text field kim decompress rate faster typic disk throughput fo srql sort relat queri languag relat unord collect record underli order sequenc stock price user pose queri reflect order find weekli move averag sql support pose queri paper show rich class queri reflect sort order natur express effici execut simpl extens sql introduct order data sequenc found wide rang commerci statist scientif applic applic requir dbm support store manipul queri sequenc effici support miss rdbmss relat model set tupl data structur sql wide queri languag relat system incap answer common queri pose commerci scientif applic move aggreg approach explor rainforest framework fast decis tree construct larg dataset classif larg dataset import data mine problem classif algorithm propos literatur studi shown algorithm uniformli outperform algorithm term qualiti paper present unifi framework decis tree classifi separ scalabl aspect algorithm construct decis tree central featur determin qualiti tree gener algorithm easi instanti specif algorithm literatur includ cart process queri linear constraint emerg applic domain databas introduc effici complex queri handl databas support applic domain includ line analyt process olap geograph inform system gi scientif databas paper focus attent form select queri express sql evalu effici current dbmss wide applic problem domain introduc process strategi class queri call queri linear constraint qblc process strategi implement wide varieti multidimension index structur includ tree variant tree buddi tree note process strategi meant gener databas guarante correct answer return numer techniqu emploi uphold guarante distinguish ch conjunct queri equival kei relat schema notion schema equival fundament databas design schema integr data model translat import notion schema equival queri equival introduc evalu correct schema transform logic equival notion calcul equival progress weaker notion schema equival introduc hull show schema depend equival notion equival ident renam order attribut relat hull conjectur result hold schema primari kei work resolv conjectur affirm case queri equival base map conjunct relat queri equal select introduct fundament concept databas theori schema equival inform tw interact inform visual devis integr queri visual larg dataset devis integr queri visual explor larg dataset demo abstract livni ramakrishnan beyer chen donjerkov lawand myllymaki wenger depart comput scienc univers wisconsin madison dayton st madison wisconsin tel fax fmiron raghu beyer guangshu donjerko ssl jussi wengerg cs wisc abstract devis data explor system user easili develop brows share visual present larg tabular dataset possibl referenc multimedia object sourc devis framework implement tool successfulli appli varieti real applic number user group make contribut combin support extend relat queri power data visual featur dataset larger main memori handl devis visual dataset excess mb data case enhanc abstract data type explos complex multi media content make crucial databas system support data effici make case gener object relat databas data type adt technolog blackbox adt current system adt abstract data type expos semant method queri optim perform semant result effici queri process ad function compromis modular data type extens type system fundament architectur requir build databas system explor implement adt predutor initi perform result demonstr order magnitud perform improv rule data dbase system relat databas system backbon busi applic year promis provid compani manag inform system cover core applic includ financi constraint databas introduct comput support environment monitor involv complex data manag data flow continu system concurr data analys complex wai valid forecast detect signific event function support build singl interfac top combin system object orient databas spatial databas expert system hybrid system sort difficult extend function requir support class data technic problem result unexpect restrict manag concurr updat constraint databas offer singl integr databas system support enhanc handl data knowledg show applic constraint simpler flexibl data model represent clean eff introduct special issu constraint databas birch data cluster algorithm applic data cluster import techniqu exploratori data analysi studi year shown practic domain data classif imag process recent grow emphasi exploratori analysi larg dataset discov pattern correl attribut call data mine data cluster regard branch exist data cluster method adequ address problem process larg dataset limit amount resourc memori cpu cycl dataset size increas scale term memori requir run time result qualiti paper effici scalabl data cluster method propos base memori data structur call cf tree serv memori summari data distribut implement system call birch effici data cluster method larg databas find pattern larg dataset attract consider interest recent wide st udi problem area identif cluster deusel popul region multi dir nension clataset prior work adequ address problem larg dataset minim cost paper present data cluster method name bfll balanc iter reduc cluster hierarchi demonstr suitabl larg databas birch increment clynamical cluster incom multi dimension metric data point produc qualiti cluster resourc memori time constraint birch typic find goocl cluster singl scan data improv qualiti aclditiou scan birch cluster algorithm proposerl databas area handl nois data point part underli pattern effect evalu birch time space effici data input order sensit cluster qualiti experi present perform comparison bir versu clara ns cluster method propos recent larg dataset ow birch consist cost dbase optim magic algebra implement magic set rewrit optim heurist complex decis support queri variant rewrit singl queri differ greatli execut perform propos cost base techniqu select effici variant choic contribut practic scheme modelsmag set rewrit special join method ad cost base queri optim deriv cost formula optim choos variant rewrit decid benefici order complex optim process preserv limit search space reason manner implement techniqu ibm db databas system perform measur demonstr costbasedmag optim techniqu perform poor decis made contribut formal algebra model comput multidimension aggreg heart olap multidimension data analysi applic abil simultan aggreg set dimens comput multidimension aggreg perform bottleneck applic paper present fast algorithm comput collect groupbi focu special case aggreg problem comput cube oper cube oper requir comput group by combin list attribut equival union number standard group oper show howth structur cube comput view term hierarchi group oper algorithm extend sort base hash base group method optim combin common oper multipl group by cach pre comput group by comput group by empir evalu show result algorithm give perform compar straightforward method paper combin work concurr comput data cube team report sag danr design implement sequenc databas system paper discuss design implement seq databas system support sequenc data seq model sequenc order collect record support declar sequenc queri languag base algebra queri oper permit algebra queri optim evalu seq built compon predat databas system support relat kind complex data distinct contribut made paper describ specif sequenc queri sequin queri languag quantit demonstr import storag optim techniqu studi effect perform present nest design paradigm predat combin sequenc relat data rule databas system databas research recogn integr product rule facil databas system uniform mechan number advanc databas featur includ integr constraint enforc deriv data mainten trigger protect version control addit databas system rule process capabl platform larg effici knowledg base expert system databas system product rule refer activ databas system field activ databas system activ paper summar current work activ databas system suggest futur research direct topic cover includ databas rule languag rule process semant implement issu introduct databas system provid persist storag massiv amount data power interfac queri modifi data databas system passiv si constraint databas introduct comput support environment monitor involv complex data manag data flow continu system concurr data analys complex wai valid forecast detect signific event function support build singl interfac top combin system object orient databas spatial databas expert system hybrid system sort difficult extend function requir support class data technic problem result unexpect restrict manag concurr updat constraint databas offer singl integr databas system support enhanc handl data knowledg show applic constraint simpler flexibl data model represent clean eff promis direct databas research magic condit recent work focuss bottomup evalu datalog program approach call magic set base rewrit logic program bottom fixpoint evalu program avoid gener irrelev fact bmsu br ram wide believ princip applic magicset techniqu restrict comput recurs queri equijoin predic extend magic set transform predic equal extend magic set techniqu practic util real relat databas recurs queri recurs queri mfpr result paper mpr defin magic set transform relat databas support sql extens describ implement magic starburst hflp give preliminari perform measur extend magic set de dadt turbo dcharg complex data gener databas applic domin rich complex data type adt technolog todai object relat databas system provid adequ perform applic basic stumbl block lack semant knowledg provid databas system adt oper develop enhanc adt adt technolog overcom problem retain extens databas system effect turbo charg complex data type result dramat improv perform adt technolog demonstr kind multi media data predat databas system cornel introduct wit explos volum complex digit inform peopl access analyz data multi media imag video audio document kind complex data import includ geograph data model queri piq imag dbm imag databas manag system idbm aim store larg collect imag support effici content base retriev paper explor idea imag data model tool describ imag domain twofold object guid featur extract incorpor semant extract summari imag discuss implement idea piq imag dbm demonstr significat gain express content base queri achiev imag databas manag system idbm aim store larg collect imag support effici content base retriev imag dbm idbm storag facil data arrang data model queri facil main idbm issu paper explor data model impact express queri languag kind queri focu select queri word framework test safeti effect comput constraint logic program clp merger declar paradigm constraint solv logic program field clp progress direct earli fundament concept adapt serv area applic survei clp primari goal give systemat descript major trend term common fundament concept main part cover theori implement issu program applic applic logic databas seq model sequenc databas paper present seq model basi system manag kind sequenc data model separ data order inform includ oper base distinct abstract sequenc main contribut seq model deal type sequenc data support express rang sequenc queri draw divers exist approach model sequenc data introduct data order domain time linear posit reflect underli order natur view sequenc applic involv sequenc data typic led special model styliz languag paper present seq model basi system build manag manipul divers kind sequenc data reason databas user kind queri sequenc data expr scientif journal extinct explos panel contain conjunct queri relat set space optim deduct databas bottom evalu logic program recurs defin view databas gener fact assum store end evalu discard fact evalu consider improv effici evalu space need evalu program cost cost maintain access indic cost elimin duplic reduc evalu method sound complet repeat deriv step fact discard evalu compromis properti show space optim method compon ensur sound complet avoid redund repetit deriv reduc fact lifetim time period fact retain evalu present techniqu base provid bound survei deduct databas system argument reduct factor identifi properti program spect predic call factor prove detect factor undecid gener show larg class program pro gram obtain appli magic set transfor mation factor respect recurs predic factor properti hold sim ple optim program gener magic set transform result program effici magic set pro gram dramat effici due reduct ariti recurs predi cate show concept factor gener iz previous identifi special case recur sion includ separ recurs left linear recurs special evalua tion algorithm rewrit strategi develop sequenc queri applic paper studi aggreg search transact time databas specif object databas model horizont segment project search kei project repres period kei valid histori queri timestamp qt kei rang qk count queri retriev number object aliv qt kei fall qk provid method accur answer queri error naliv qt naliv qt number object aliv time qt constant denot disk page size techniqu requir space process queri logb time support updat logb amort os demonstr extens experi propos solut guarante queri result extrem high precis median rel error consum fraction space occupi exist approach promis precis result vldb journal schema equival heterogen system bridg theori practic extend abstract constraint object sequenc queri process applic requir abil manipul sequenc data motiv import sequenc queri process present framework optim sequenc queri base techniqu includ queri transform optim util meta data cach intermedi result present bottom algorithm gener effici queri evalu plan base cost estim work identifi number direct futur research direct introduct real life applic manipul data inher sequenti data logic view queri term sequenc abstract physic store sequenc databas sequenc queri declar manner util order semant data advantag opportun queri optim relat databas inadequ perform studi transit closur algorithm semant optim constraint queri databas chimera databas languag jointli design research politecnico di milano bonn univers ecrc munich context esprit project idea chimera integr object orient data model declar queri languag base deduct rule activ rule languag reactiv process paper present author propos constraint manag chimera reli declar specif passiv constraint deduct rule transform type activ rule introduct constraint declar specif properti satisfi databas instanc oodb constraint typic restrict admiss extens class impos restrict state individu object gener law obei set object possibl belong class face violat constraint rule order bottom dup fixpoint evalu logic program abstract logic program evalu bottom repeatedli appli rule amp quot iter amp quot fixpoint reach desir case program stratifi negat guarante semant appli rule order present algorithm appli rule order repeat infer gsn capabl deal wide rang rule order overhead semi naiv algorithm call bsn psn handl smaller class rule order overhead bsn demonstr choos good order reduc number rule applic join present theoret analysi rule order identifi order minim number rule applic instanc base relat respect class order call fair order show fair order data set wors analysi supplement perform result schema equival heterogen system bridg theori practic current theoret work offer measur schema equival base inform capac schema work base exist abstract function satisfi restrict set instanc schema schema aris practic clear reason exist abstract function notion equival tend liber schema consid equival practition result practic integr methodolog util theoret foundat reli ad hoc approach present result seek bridg gap problem decid inform capac equival domin schema occur practic express inherit simpl integr constraint show problem undecid undecidab forget past repeat abstract interpret logic program magic transform coral deduct system coral deduct system support rich declar languag interfac combin declar imper program declar queri languag support gener horn claus augment complex term set group aggreg negat relat tupl univers quantifi variabl coral declar program organ collect interact modul coral implement support wide rang evalu strategi automat choos effici evalu strategi modul program addit user permit guid queri optim desir select wide rang control choic level modul coral system imper construct updat insert delet rule coral interfac user program combin declar coral extend explain program execut deduct system program deduct databas program system natur mean base mathemat read logic rule high level explan program evalu execut construct provid ad function debug program chain deduct lead unexpect possibl incorrect conclus follow deriv correct conclus determin reach identifi consequ typic incorrect unexpect fact function util perform post mortem analysi session interact develop program run queri view deduct simultan explan program import context deduct databas reason program involv recurs chain infer evid input data set larg optim bottom dup evalu dground term extend dfound valid semant aggreg present gener techniqu defin semant program aggreg techniqu extend found semant valid semant design provid semant program negat handl program possibl recurs aggreg gener base simpl power idea aggreg valu multiset valu multiset make extend found semant call aggreg found semant intuit extens found model van gelder van semant van gelder semant agre program semant result van gelder intuit desir semant provid extend valid semant call aggreg valid semant gener intuit semant present earlier aggreg explain program execut deduct system program deduct databas program system natur mean base mathemat read logic rule high level explan program evalu execut construct provid ad function debug program chain deduct lead unexpect possibl incorrect conclus follow deriv correct conclus determin reach identifi consequ typic incorrect unexpect fact function util perform post mortem analysi session interact develop program run queri view deduct simultan explan program import context deduct databas reason program involv recurs chain infer evid input data set larg understand schema problem schema integr translat adequ address precis understand schema need present analysi notion schema exist integr methodolog show inher ambigu imprecis tradit definit schema hamper develop formal schema integr methodolog specif tradit notion schema data form metadata superflu structur inform semant meaning argu import cleanli separ structur inform data remov consider artifact specif data model design methodolog end introduc notion schema intens captur semant content schema closer schema current work schema integr notion schema defin specif data model design methodolog notion vari implement coral deduct databas system coral deduct databas system modular declar queri languag program languag coral deduct system support rich declar languag wide rang evalu method combin declar imper program data persist disk resid main memori describ architectur implement coral import goal design coral architectur integr optim techniqu reason fashion user influenc evalu strategi exploit full power coral implement coral declar program organ collect interact modul modul structur kei satisfi goal high level modul interfac modul evalu techniqu interact transpar fashion user option tailor execut program select wide rang control choic level modul coral interfac user program combin declar coral extend coral primit high degre extens provid allow programm class structur enhanc coral implement coral deduct databas system inform capac schema integr translat paper carefulli explor assumpt inform capac equival measur correct judg transform schema schema integr translat methodolog present classif common integr translat task base oper goal deriv rel inform capac requir origin transform schema show task inform capac equival schema strictli requir base present definit correct reflect undertaken task examin exist methodolog show anomali aris meet propos correct criteria introduct formal work schema equival larg practic schema integr translat tool practition felt theoret work narrow scope applic problem coral ad object dorient logic databas languag coral databas program languag integr coral type system data model arbitrari object databas fact declar queri languag extend coral express rule coral support imper rule base languag integr provid support updat design implement coral incorpor import decis data model base class definit method invoc handl compil notion class orthogon work raghu ramakrishnan divesh srivastava praveen seshadri support david lucil packard foundat fellowship scienc engin presidenti young investig award match grant dec tandem xerox nsf grant iri address author comput scienc depart univers wisconsin madison wi mimsi system stock market analysi coral deduct databas system mimsi system analyz time seri data stock market domain vi overview introduct acknowledg languag overview queri languag command line interfac graph util select claus select attribut repeat claus claus relat oper claus chang claus cross claus condit interv transit closur algorithm base graph travers push constraint select paper present procedur gener propag minimum qrp constraint termin base definit program predic section propag minimum qrp constraint origin program obtain program fulli util constraint inform present origin program procedur base procedur procedur gen prop predic constraint gener propag constraint satisfi program predic base definit logic queri optim proff dtree transform push constraint select paper present procedur gener propag minimum qrp constraint termin base definit program predic section propag minimum qrp constraint origin program obtain program fulli util constraint inform present origin program procedur base procedur procedur gen prop predic constraint gener propag constraint satisfi program predic base definit control search bottom dup evalu bottom evalu queri deduct databas advantag evalu scheme prolog sound complet respect declar semant herbrand model posit horn claus program avoid infinit loop detect repeat possibl cyclic subgoal databas applic effici prolog due set oriented complet set orient breadth search strategi bottomup evalu disadvantag evalu class program negat aggreg order infer essenc evalu answer neg subgoal make infer depend neg subgoal complet breadth search strategi maintain lot redund subgoal depend inform achiev present techniqu order push constraint select paper present procedur gener propag minimum qrp constraint termin base definit program predic section propag minimum qrp constraint origin program obtain program fulli util constraint inform present origin program procedur base procedur procedur gen prop predic constraint gener propag constraint satisfi program predic base definit valid model semant logic program present valid model semant approach provid semant logic program negat setterm group valid model semant threevalu semant defin term normal form comput valid model semant mean gener ground fact fact variabl comput formul semant term normal form comput offer import insight valid model semant semant propos earlier show valid model semant extend found semant natur manner advantag found semant understood variant normal form comput normal form comput valid semant natur found semant show valid model semant desir prop coral control relat logic coral modular declar queri languag program languag support gener horn claus complex term set group aggreg negat relat tupl univers quantifi variabl support persist relat provid exodu storag manag uniqu featur coral wide rang evalu strategi user option tailor execut program high level annot coral program organ collect modul structur basi express control choic coral interfac class structur provid extens final coral support command sublanguag statement evalu user order statement queri updat product system style rule command type coral system prompt work support da optim bottom dup evalu dground term extend abstract bottom dup evalu logic program recent year work direct evalu logic program queri deduct databas iter bottom fixpoint comput result techniqu offer attract altern prolog style top evalu situat sound complet posit horn claus program suit applic larg volum data fact support varieti extens standard logic program paradigm present basic databas queri evalu logic program evalu discuss bottom fixpoint evalu discuss approach base program transform magic templat restrict search fixpoint comput techniqu semi naiv evalu avoid repeat infer program transform techniqu focus fixpoint evalu forward chain strategi propag bind goal ma top ddown versu bottom dup revisit space optim bottom dup evalu logic program bottom evalu logic program gener fact assum store end evalu consider gain achiev discard fact longer requir space need evalu program reduc cost reduc cost maintain access indic elimin duplic reduc discard fact earli achiev time space improv evalu method sound complet repeat deriv step fact discard evalu compromis properti contribut show space optim techniqu distinct compon inform make deriv fact detect duplic deriv fact order comput minim lifespan fact separ enabl di aggreg relev deduct databas paper present techniqu optim queri deduct databas aggreg oper min max largest ic valu approach base extend notion relev fact queri take aggreg oper account approach part rewrit part label predica te ag gregat select evaluat ion part hat make aggreg select detect fact irrelev discard rewrit complement standard rewrit ing algorithm magic set evalu essenti refin semi naiv evalu parallel logic program parallel logic program attract interest research commun intrins parallel logic program research stream aim transpar exploit parallel exist logic program languag prolog whale famili concurr logic languag develop languag construct allow programm express concurr commun synchron parallel process algorithm articl concentr transpar exploit parallel survei matur solut problem solv order obtain effici implement solut implement effici parallel logic program system reach effect speedup state art sequenti prolog implement articl address current prospect research issu extend applic effici exist system model merg transpar parallehsm concurr logic languag approach combin constraint logic program parallel highli parallel architectur power magic magic templat spellbind approach logic program bottom queri evalu scheme fact relat allow nonground term magic set queri rewrit techniqu gener argument predic treat bound rule provid ground bind argument regard bound argument function symbol variabl appear argument list gener magic predic defin comput set goal reach top explor rule start queri goal goal fact constant previou version magic set algorithm magic predic restrict bottom evalu rule redund action step bottom comput perform algorithm sidewai inform pass strategi sip price paid compar prev magic condit recent work focuss bottomup evalu datalog program approach call magic set base rewrit logic program bottom fixpoint evalu program avoid gener irrelev fact bmsu br ram wide believ princip applic magicset techniqu restrict comput recurs queri equijoin predic extend magic set transform predic equal extend magic set techniqu practic util real relat databas recurs queri recurs queri mfpr result paper mpr defin magic set transform relat databas support sql extens describ implement magic starburst hflp give preliminari perform measur extend magic set de parallel logic program parallel logic program attract interest research commun intrins parallel logic program research stream aim transpar exploit parallel exist logic program languag prolog whale famili concurr logic languag develop languag construct allow programm express concurr commun synchron parallel process algorithm articl concentr transpar exploit parallel survei matur solut problem solv order obtain effici implement solut implement effici parallel logic program system reach effect speedup state art sequenti prolog implement articl address current prospect research issu extend applic effici exist system model merg transpar parallehsm concurr logic languag approach combin constraint logic program parallel highli parallel architectur magic relev defin magic set transform tradit relat system duplic aggreg group relat system extend recurs compar magic set rewrit tradit optim techniqu nonrecurs queri perform experi argu magic set transform optim techniqu introduct magic set queri transform algorithm bmsu class algorithm part work ibm almaden research center work stanford support nsf grant iri air forc grant afosr grant ibm corpor author current affili tandem comput part work author visit ibm almaden research center work wisconsin support ibm faculti develop award nsf grant iri gener magic set br magic tem magic duplic aggreg present formal treatment multiset aris duplic elimin aggreg oper deduct relat databas defin semant rigor extend magic set techniqu program multiset aggreg work present import step demonstr applic magic set techniqu optim queri commerci queri languag sql introduct previou treatment datalog propos extens treat program collect definit set fact tupl hand commerci queri languag sql typic support definit set multiset tupl provid aggreg oper sum count set multiset abil deal multiset part work ibm almaden research center work stanford support nsf grant iri air forc grant afosr forget past repeat rule order bottom dup fixpoint evalu logic program abstract logic program evalu bottom repeatedli appli rule amp quot iter amp quot fixpoint reach desir case program stratifi negat guarante semant appli rule order present algorithm appli rule order repeat infer gsn capabl deal wide rang rule order overhead semi naiv algorithm call bsn psn handl smaller class rule order overhead bsn demonstr choos good order reduc number rule applic join present theoret analysi rule order identifi order minim number rule applic instanc base relat respect class order call fair order show fair order data set wors analysi supplement perform result coral databas program languag bound propag select logic program vu fixpoint logic program proof dtree transform theorem applic effici evalu left mult dlinear rule argument reduct factor identifi properti program spect predic call factor prove detect factor undecid gener show larg class program pro gram obtain appli magic set transfor mation factor respect recurs predic factor properti hold sim ple optim program gener magic set transform result program effici magic set pro gram dramat effici due reduct ariti recurs predi cate show concept factor gener iz previous identifi special case recur sion includ separ recurs left linear recurs special evalua tion algorithm rewrit strategi develop magic templat spellbind approach logic program bottom queri evalu scheme fact relat allow nonground term magic set queri rewrit techniqu gener argument predic treat bound rule provid ground bind argument regard bound argument function symbol variabl appear argument list gener magic predic defin comput set goal reach top explor rule start queri goal goal fact constant previou version magic set algorithm magic predic restrict bottom evalu rule redund action step bottom comput perform algorithm sidewai inform pass strategi sip price paid compar prev axiomat approach decid queri safeti deduct databas optim existenti datalog queri framework test safeti effect comput extend datalog extend abstract effici transit closur algorithm present transit closur algorithm base strong compon detect algorithm effici previou transit closur algorithm base strong compon detect gener unnecessari partial successor set scan input graph keyword design algorithm transit closur strong compon tarjan algorithm random graph simul introduct direct graph set vertic theta set edg loss gener assum loop graph repres set adjac list adj fw transit closur graph edg null path successor set vertex set succ fw vertic perform evalu data intens logic program set negat logic databas languag ldl bound propag select logic program power magic safeti recurs horn claus infinit relat annot distribut program logic amateur introduct recurs queri process strategi amateur introduct recurs queri process strategi safeti recurs horn claus function symbol mr diagram model conceptu databas design 